Foodsheds in Virtual Water Flow Networks: A Spectral Graph Theory Approach

Foodsheds in Virtual Water Flow Networks: A Spectral Graph Theory Approach

A foodshed is a geographic area from which a population derives its food supply, but a method to determine boundaries of foodsheds has not been formalized. Drawing on the food–water–energy nexus, we propose a formal network science definition of foodsheds by using data from virtual water flows, i.e., water that is virtually embedded in food. In particular, we use spectral graph partitioning for...

VULNERABILITY ASSESSMENT OF WATER DISTRIBUTION NETWORKS: GRAPH THEORY METHOD

The main functional purpose of a water distribution network is to transport water from a source to several domestic and industrial units while at the same time satisfying various requirements on hydraulic response. All the water distribution networks perform two basic operations: firstly the water network needs to deliver adequate amounts of water to meet specific requirements, and secondly the...

Spectral graph theory

With every graph (or digraph) one can associate several different matrices. We have already seen the vertex-edge incidence matrix, the Laplacian and the adjacency matrix of a graph. Here we shall concentrate mainly on the adjacency matrix of (undirected) graphs, and also discuss briefly the Laplacian. We shall show that spectral properies (the eigenvalues and eigenvectors) of these matrices pro...

Spectral graph theory

Spectral graph theory

Spectral graph theory is a fast developing field in modern discrete mathematics with important applications in computer science, chemistry and operational research. By merging combinatorial techniques with algebraic and analytical methods it creates new approaches to hard discrete problems and gives new insights in classical Linear Algebra. The proposed minisymposium will bring together leading...